Fast computation of generic bivariate resultants

We prove that the resultant of two “sufficiently generic” bivariate polynomials over a finite field can be computed in quasi-linear expected time, using a randomized algorithm of Las Vegas type. A similar complexity bound is proved for the computation of the lexicographical Gröbner basis for the ideal generated by the two polynomials.     

Imposing accurate wall boundary conditions in corrective‐matrix‐based moving particle semi‐implicit method for free surface flow

Corrective matrix that is derived to restore consistency of discretization schemes can significantly enhance accuracy for the inside particles in the Moving Particle Semi‐implicit method. In this situation, the error due to free surface and wall boundaries becomes dominant. Based on the recent study on Neumann boundary condition (Matsunaga et al, CMAME, 2020), the corrective matrix schemes in MPS are generalized to straightforwardly and accurately impose Neumann boundary condition. However, the new schemes can still easily trigger instability at free surface because of the biased error caused by the incomplete/biased neighbor support. Therefore, the existing stable schemes based on virtual particles and conservative gradient models are applied to free surface and nearby particles to produce a stable transitional layer at free surface. The new corrective matrix schemes are only applied to the particles under the stable transitional layer for improving the wall boundary conditions. Three numerical examples of free surface flows demonstrate that the proposed method can help to reduce the pressure/velocity fluctuations and hence enhance accuracy further.     

B(X)上保持约当积的固定点的满射

设B(X)是维数大于等于3的复Banach空间X上有界线性算子全体构成的代数.设A∈B(X),若Ax=x,则称x∈X是算子A的固定点.Fix(A)表示A的所有固定点的集合.本文刻画了B(X)上保持算子的Jordan积的固定点的满射.     

The Green polynomials via vertex operators

An iterative formula for the Green polynomial is given using the vertex operator realization of the Hall-Littlewood function. Based on this, (1) a general combinatorial formula of the Green polynomial is given; (2) several compact formulas are given for Green's polynomials associated with upper partitions of length ≤3 and the diagonal lengths ≤3; (3) a Murnaghan-Nakayama type formula for the Green polynomial is obtained; and (4) an iterative formula is derived for the bitrace of the finite general linear group G and the Iwahori-Hecke algebra of type A on the permutation module of G by its Borel subgroup.